Some specially formulated axiomizations for ISigma0 manage to evade the Herbrandized version of the Second Incompleteness Theorem
نویسنده
چکیده
In 1981, Paris and Wilkie [28] indicated it was an open question whether IΣ0 would satisfy the Second Incompleteness Theorem for Herbrand deduction. We will show that some specially formulated axiomizations for IΣ0 can evade the Herbrandized version of the Second Incompleteness Theorem.
منابع مشابه
The Axiom System ISigma0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem
In 1981, Paris and Wilkie [21] indicated it was an open question whether IΣ0 would satisfy the Second Incompleteness Theorem for Herbrand deduction. We will show that IΣ0 will both obey and defy the Herbrandized version of the Second Incompleteness Theorem, depending on which of several equivalent definitions of IΣ0 one examines.
متن کاملPassive induction and a solution to a Paris-Wilkie open question
In 1981, Paris and Wilkie raised the open question about whether and to what extent the axiom system IΣ0 did satisfy the Second Incompleteness Theorem under Semantic Tableaux deduction. Our prior work showed that the semantic tableaux version of the Second Incompleteness Theorem did generalize for the most common definition of IΣ0 appearing in the standard textbooks. However, there was an alter...
متن کاملA generalization of the Second Incompleteness Theorem and some exceptions to it
This paper will introduce the notion of a naming convention and use this paradigm to both develop a new version of the Second Incompleteness Theorem and to describe when an axiom system can partially evade the Second Incompleteness Theorem.
متن کاملSome New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem
This article continues our study of axiom systems that can verify their own consistency and prove all Peano Arithmetic’s Π1 theorems. We will develop some new types of exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem.
متن کاملTheorems of Tarski's Undefinability and Godel's Second Incompleteness - Computationally
We show that the existence of a finitely axiomatized theory which can prove all the true Σ1 sentences may imply Gödel’s Second Incompleteness Theorem, by incorporating some bi-theoretic version of the derivability conditions (first discussed by Detlefsen 2001). We also argue that Tarski’s theorem on the undefinability of truth is Gödel’s first incompleteness theorem relativized to definable ora...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 207 شماره
صفحات -
تاریخ انتشار 2009